Methodology for nonparametric deconvolution when the error distribution is unknown
نویسنده
چکیده
In the nonparametric deconvolution problem, in order to estimate consistently a density or distribution from a sample of data contaminated by additive random noise, it is often assumed that the noise distribution is completely known or that an additional sample of replicated or validation data is available. Methods also have been suggested for estimating the scale of the error distribution, but they require somewhat restrictive smoothness assumptions on the signal distribution, which can be hard to verify in practice. In the present paper we take a completely new approach to the problem, not requiring extra data of any type. We argue that data rarely come from a simple, regular distribution, and that this can be exploited to estimate the signal distributions using a simple procedure. Our method can be extended to other problems involving errors-in-variables, such as nonparametric regression estimation. Its performance in practice is remarkably good, often equalling (even unexpectedly) the performance of techniques that use additional data to estimate the unknown error distribution. Some
منابع مشابه
The effects of error magnitude and bandwidth selection for deconvolution with unknown error distribution.
The error distribution is generally unknown in deconvolution problems with real applications. A separate independent experiment is thus often conducted to collect the additional noise data in those studies. In this paper, we study the nonparametric deconvolution estimation from a contaminated sample coupled with an additional noise sample. A ridge-based kernel deconvolution estimator is propose...
متن کاملGlobal Behavior of Deconvolution Kernel Estimates
The desire to recover the unknown density when data are contaminated with errors leads to nonparametric deconvolution problems. The difficulty of deconvolution depends on both the smoothness of error distribution and the smoothness of the priori. Under a general class of smoothness constraints, we show that deconvolution kernel density k-l estimates achieve the best attainable global rates of c...
متن کاملDeconvolution with Supersmooth Distributions
The desire to recover the unknown density when data are contaminated with errors leads to nonparametric deconvolution problems. Optimal global rates of convergence are found under the weighted Lp-loss (1 $ p $ 00). It appears that the optimal rates of convergence are extremely slow for supersmooth error distributions. To overcome the difficulty, we examine how large the noise level can be for d...
متن کاملDeconvolution Based Score Tests in Measurement Error Models
Consider a generalized linear model with response Y and scalar predictor X. Instead of observing X, a surrogate W = X + Z is observed where Z represents measurement error and is independent of X and Y. The efficient score test for the absence of association depends on m(w) = E(XIW = w) which is generally unknown (Tosteson and Tsiatis, 1988). Assuming that the distribution of Z is known, asympto...
متن کاملBlockwise SVD with error in the operator and application to blind deconvolution
Abstract: We consider linear inverse problems in a nonparametric statistical framework. Both the signal and the operator are unknown and subject to error measurements. We establish minimax rates of convergence under squared error loss when the operator admits a blockwise singular value decomposition (blockwise SVD) and the smoothness of the signal is measured in a Sobolev sense. We construct a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014